Turing machine - PDFSEARCH.IO - Document Search Engine

Turing machine
Results: 564

#	Item
381	Hypercomputation, Unconsciousness and Entertainment Technology Matthias Rauterberg Industrial Design, Eindhoven University of Technology, The Netherlands Abstract. Recent developments in computer science introduce and d Add to Reading List Source URL: www.idemployee.id.tue.nl Language: English - Date: 2008-11-11 13:29:07 Theory of computation Mental processes Alan Turing Computability theory Hypercomputation Church–Turing thesis Consciousness Turing machine Algorithm Mind Cognitive science Philosophy of mind
382	in Artificial Life VIII, Standish, Abbass, Bedau (eds)(MIT Press[removed]pp 75–78 1 An Abstraction of Intercellular Communication Thomas E. Portegys Add to Reading List Source URL: www.alife.org Language: English - Date: 2013-01-14 08:19:01 Systems biology Morphogen Cellular automaton Turing machine Cell signaling Glider Computer Gun French flag model Biology Theory of computation Morphogens
383	in Artificial Life VIII, Standish, Abbass, Bedau (eds)(MIT Press[removed]pp 49–52 1 Von Neumann’s Machine in the Shell: Enhancing the Robustness of Self-Replication Processes Add to Reading List Source URL: www.alife.org Language: English - Date: 2013-01-14 08:19:24 Applied mathematics Cellular automaton Self-replicating machine John von Neumann Self-replication Automata theory Turing machine Universal constructor Von Neumann universal constructor Artificial life Science Mathematics
384	CAN A TURING PLAYER IDENTIFY ITSELF? DAVID K. LEVINE AND AND BALÁZS SZENTES A BSTRACT. We show that the problem of whether two Turing Machines are functionally equivalent is undecidable and explain why this is significa Add to Reading List Source URL: www.dklevine.com Language: English - Date: 2006-03-16 11:03:47 Applied mathematics Alan Turing Turing machine Theory of computation Models of computation Computability NP Machine that always halts Halting problem Theoretical computer science Computability theory Mathematics
385	Microsoft Word - fp15927-ritter.docx Add to Reading List Source URL: turing.cs.washington.edu Language: English - Date: 2009-02-11 17:42:39 Learning Statistical classification AdaBoost Pattern recognition File select Recommender system Machine learning Statistics Artificial intelligence
386	The following document comes from the South Western Electricity Historical Society website at www.swehs.co.uk This site contains all the necessary contact information you may require. Do visit the site – you may find m Add to Reading List Source URL: swehs_archive.swelocker.co.uk Language: English - Date: 2009-07-10 07:29:01 Milton Keynes NCR Corporation Alan Turing Bombe Ultra Enigma machine British Tabulating Machine Company Colossus computer Enigma Cryptography Espionage Bletchley Park
387	NO TURING MACHINE CAN REPLICATE AN ARBITRARILY CHOSEN TURING MACHINE BY OBSERVING ITS RESPONSES Kerry M. Soileau November 9, 2005 ABSTRACT Add to Reading List Source URL: www.kerrysoileau.com Language: English - Date: 2008-09-08 17:17:41 Computability theory Theory of computation Models of computation Turing machine Alan Turing Computability Hyperconnected space Reduction NP Theoretical computer science Applied mathematics Computer science
388	Theory of computation: Summary of main concepts 6. Effective computability: Turing machines Universal TM (UTM) interpreter that reads the description of any arbitrary TM M and executes operations on Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-11-28 16:45:13 Computer science Turing machine Alan Turing Formal languages Halting problem Machine that always halts Computability Church–Turing thesis Computable function Computability theory Theoretical computer science Theory of computation
389	Free University of Bolzano, Prof. J. Nievergelt: Formal Languages, Sem 1, Fall 2006 Oct 02 Models of computation: Ruler and compass, systolic arrays, finite state machines Oct 02 Lab Kara: study examples and write a pr Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2006-11-23 06:52:35 Computability theory Models of computation Turing machine Computability Finite-state machine Automata theory Halting problem Busy beaver Computable function Theoretical computer science Computer science Theory of computation
390	jn[removed]Finite automata with external storage Concepts of this chapter: Finite automata with external storage of unbounded capacity, subject to various access restrictions that limit the automa’s power of compu Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2004-11-18 06:12:14 Theoretical computer science Deterministic pushdown automaton Nondeterministic finite automaton Finite-state machine Turing machine Linear bounded automaton Alphabet Queue automaton Counter automaton Automata theory Theory of computation Models of computation

UPDATE